Randomized Permutations in a Coarse Grained Parallel Environment [extended abstract]
نویسنده
چکیده
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in a coarse grained parallel environment with p processors. In contrast to previously known work, our method is able to fulfill the three goals of uniformity, work-optimality and balance among the processors simultaneously. To guarantee the uniformity we investigate the matrix of communication requests between the processors. We show that its distribution is a generalization of the multivariate hypergeometric distribution and we give algorithms to compute it efficiently.
منابع مشابه
Practical Algorithms for Selection on Coarse-Grained Parallel Computers
In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for parallel selection. Experimental results on the CM5 demonstrate that randomized algorithms are superior to their deterministic counterparts.
متن کاملExtended Parallelism Models For Optimization On Massively Parallel Computers
1. Abstract Single-level parallel optimization approaches, those in which either the simulation code executes in parallel or the optimization algorithm invokes multiple simultaneous single-processor analyses, have been investigated previously and have been shown to be effective in reducing the time required to compute optimal solutions. However, these approaches have clear performance limitatio...
متن کاملGraph coloring on coarse grained multicomputers
We present an efficient and scalable Coarse Grained Multicomputer (CGM) coloring algorithm that colors a graph G with at most ∆+1 colors where ∆ is the maximum degree in G. This algorithm is given in two variants: a randomized and a deterministic. We show that on a p-processor CGM model the proposed algorithms require a parallel time of O( |G| p ) and a total work and overall communication cost...
متن کاملExploiting loop-level parallelism on coarse-grained reconfigurable architectures using modulo scheduling - Computers and Digital Techniques, IEE Proceedings-
Coarse-grained reconfigurable architectures have become increasingly important in recent years. Automatic design or compilation tools are essential to their success. A modulo scheduling algorithm to exploit loop-level parallelism for coarse-grained reconfigurable architectures is presented. This algorithm is a key part of a dynamically reconfigurable embedded systems compiler (DRESC). It is cap...
متن کاملCoarse-Grain Parallel Computing Using the ISIS Toolkit
Abstract: A coarse-grained parallel (distributed) computing application using the ISIS toolkit is described. The method should be applicable to any serial program suitable for coarse-grain parallelization. Criteria for parallelizing existing programs, factors which affect the speed of parallel programs, and benefits in addition to quicker turnaround time are described. Future tasks to obtain mo...
متن کامل